An upper bound on algebraic connectivity of graphs with many cutpoints
نویسندگان
چکیده
Let G be a graph on n vertices which has k cutpoints. A tight upper bound on the algebraic connectivity of G in terms of n and k for the case that k > n/2 is provided; the graphs which yield equality in the bound are also characterized. This completes an investigation initiated by the author in a previous paper, which dealt with the corresponding problem for the case that k ≤ n/2.
منابع مشابه
Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
The algebraic connectivity of the graph Laplacian plays an essential role in various multi-agent control systems. In many cases a lower bound of this algebraic connectivity is necessary in order to achieve a certain performance. Lately, several methods based on distributed Power Iteration have been proposed for computing the algebraic connectivity of a symmetric Laplacian matrix. However, these...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملUpper Bounds on Algebraic Connectivity via Convex Optimization
The second smallest eigenvalue of the Laplacian matrix L of a graph is called its algebraic connectivity. We describe a method for obtaining an upper bound on the algebraic connectivity of a family of graphs G. Our method is to maximize the second smallest eigenvalue over the convex hull of the Laplacians of graphs in G, which is a convex optimization problem. By observing that it suffices to o...
متن کاملMaximizing algebraic connectivity for certain families of graphs
We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on n vertices and with maximum degree d is bounded above by 2 (d− 2) 1 n + O ( lnn n2 ) . We then investigate upper bounds on algebraic connectivity for cubic graphs. We show that algebraic connectivity of a cub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001